Hybrid teaching–learning-based optimization for solving engineering and mathematical problems

نویسندگان

چکیده

In this work, a new and effective algorithm called hybrid teaching–learning-based optimization (TLBO) charged system search (CSS) algorithms (HTC) are proposed to solve engineering mathematical problems. The CSS is inspired by Coulomb Gauss’s electrostatic laws of physics as well the Newtonian mechanic motion. TLBO interaction between teacher student in classroom. Usually, gets trapped local optimal due lack for measuring distance point. order problem, algorithm, which based on electrical laws, utilized. each factor stored under influence best global positions, it used subsequent iterations possible answers. fact, leads better balance exploration exploitation. validate method, CEC2021 CEC2005 functions optimized. Additionally, show applicability evaluate its performance convergence rate, several benchmark truss structures weight structural elements taken into account objective function, optimized displacement stress constraints. results compared with some other well-known meta-heuristic methods. that HTC improved rate quickly obtained desired design. can be adapted complex

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems

These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...

متن کامل

A FAST GA-BASED METHOD FOR SOLVING TRUSS OPTIMIZATION PROBLEMS

Due to the complex structural issues and increasing number of design variables, a rather fast optimization algorithm to lead to a global swift convergence history without multiple attempts may be of major concern. Genetic Algorithm (GA) includes random numerical technique that is inspired by nature and is used to solve optimization problems. In this study, a novel GA method based on self-a...

متن کامل

EFFICIENCY OF IMPROVED HARMONY SEARCH ALGORITHM FOR SOLVING ENGINEERING OPTIMIZATION PROBLEMS

Many optimization techniques have been proposed since the inception of engineering optimization in 1960s. Traditional mathematical modeling-based approaches are incompetent to solve the engineering optimization problems, as these problems have complex system that involves large number of design variables as well as equality or inequality constraints. In order to overcome the various difficultie...

متن کامل

Unified Particle Swarm Optimization for Solving Constrained Engineering Optimization Problems

We investigate the performance of the recently proposed Unified Particle Swarm Optimization method on constrained engineering optimization problems. For this purpose, a penalty function approach is employed and the algorithm is modified to preserve feasibility of the encountered solutions. The algorithm is illustrated on four well–known engineering problems with promising results. Comparisons w...

متن کامل

A New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems

Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of The Brazilian Society of Mechanical Sciences and Engineering

سال: 2022

ISSN: ['1678-5878', '1806-3691']

DOI: https://doi.org/10.1007/s40430-022-03700-x